Hydrodynamic limit of move-to-front rules and search cost probabilities
نویسندگان
چکیده
We study a hydrodynamic limit approach to move-to-front rules, namely, a scaling limit as the number of items tends to infinity, of the joint distribution of jump rate and position of items. As an application of the limit formula, we present asymptotic formulas on search cost probability distributions, applicable for general jump rate distributions.
منابع مشابه
Multi-Objective Tabu Search Algorithm to Minimize Weight and Improve Formability of Al3105-St14 Bi-Layer Sheet
Nowadays, with extending applications of bi-layer metallic sheets in different industrial sectors, accurate specification of each layer is very prominent to achieve desired properties. In order to predict behavior of sheets under different forming modes and determining rupture limit and necking, the concept of Forming Limit Diagram (FLD) is used. Optimization problem with objective functions an...
متن کاملAsymptotic Approximation of the Move-to-front Search Cost Distribution and Least-recently Used Caching Fault Probabilities
Consider a finite list of items n = 1;2; : : : ;N, that are requested according to an i.i.d. process. Each time an item is requested it is moved to the front of the list. The associated search cost CN for accessing an item is equal to its position before being moved. If the request distribution converges to a proper distribution as N→∞, then the stationary search cost CN converges in distributi...
متن کاملLimiting search cost distribution for the move-to-front rule with random request probabilities
Consider a list of n files whose popularities are random. These files are updated according to the move-tofront rule and we consider the induced Markov chain at equilibrium. We give the exact limiting distribution of the search-cost per item as n tends to infinity. Some examples are supplied.
متن کاملLimiting behavior of the search cost distribution for the move-to-front rule in the stable case
Abstract Move-to-front rule is a heuristic updating a list of n items according to requests. Items are required with unknown probabilities (or popularities). The induced Markov chain is known to be ergodic [4]. One main problem is the study of the distribution of the search cost defined as the position of the required item. Here we first establish the link between two recent papers [3,8] that b...
متن کاملGovernance: Blending Bureaucratic Rules with Day to Day Operational Realities; Comment on “Governance, Government, and the Search for New Provider Models”
Richard Saltman and Antonio Duran take up the challenging issue of governance in their article “Governance, Government and the Search for New Provider Models,” and use two case studies of health policy changes in Sweden and Spain to shed light on the subject. In this commentary, I seek to link their conceptualization of governance, especially its interrelated roles at the macro, meso, and micro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0908.3222 شماره
صفحات -
تاریخ انتشار 2009